Routing Overhead Aware Optimal Cluster based Routing Algorithm for IoT Network using Heuristic Technique
نویسندگان
چکیده
Globally, billion of devices in heterogeneous networks are interconnected by the Internet Things (IoT). IoT applications require a centralized decision-making system due to failure-prone connectivity and high latency such system. Low-latency communications primary characteristic applications. Since usually have small payload sizes, reducing communication overhead is crucial improving energy efficiency. Researchers proposed several methods resolve load balancing issue reduce overhead. Although these techniques not effective, terms costs, end-to-end delay, packet loss ratio, throughput, node lifetimes negatively impact network performance. In this paper, we propose aware optimal cluster-based (COOC) routing algorithm for based on hybrid heuristic technique. Using three benchmark algorithms, form load-balanced clusters using k-means clustering, fuzzy logic, genetic algorithm. next step, compute rank each cluster multiple design constraints, which optimized improved COOT bird optimum search (I-COOT). After that, choose head (CH) according condition, thereby networks. Additionally, chaotic golden optimization (CGSO) choosing best path between nodes among paths ensure data transfer from CHs. To conclude, validate our COOC against different simulation scenarios compare results with existing state-of-the-art algorithms.
منابع مشابه
A novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملA Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem
A significant portion of Gross Domestic Production (GDP) in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG). In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (...
متن کاملGossip-Based Energy Aware Routing Algorithm for Wireless Sensor Network
Many advances have been made in wireless sensor networks (WSNs) which are as varied as the applications; and many more are in progress. There are some intrinsic limitations related to WSNs, including scarcity of energy supply, limited processing ability, and lack of processing memory. One of the important considerations of network designers is to devise protocols and algorithms in order to tack...
متن کاملImproving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks
Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...
متن کاملNode Based Cluster Routing Algorithm for Mobile Ad-Hoc Network
Mobility of node is an important subject at the time of clustering in mobile ad hoc network as it directly affects the strength of the cluster. MANETs clustering based algorithms commonly suffers with crash of cluster-head problem, which degrades the cluster stability. This paper proposes, Node Based Cluster Routing Algorithm (NBCRA), a schema to improve the cluster stability and in-turn to imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2023
ISSN: ['2158-107X', '2156-5570']
DOI: https://doi.org/10.14569/ijacsa.2023.0140207